\hypertarget{matrix__shortest__path_8h}{}\section{src/graph\+\_\+algorithms/all\+\_\+node\+\_\+pair\+\_\+shortest\+\_\+path/matrix\+\_\+shortest\+\_\+path/matrix\+\_\+shortest\+\_\+path.h File Reference}
\label{matrix__shortest__path_8h}\index{src/graph\+\_\+algorithms/all\+\_\+node\+\_\+pair\+\_\+shortest\+\_\+path/matrix\+\_\+shortest\+\_\+path/matrix\+\_\+shortest\+\_\+path.\+h@{src/graph\+\_\+algorithms/all\+\_\+node\+\_\+pair\+\_\+shortest\+\_\+path/matrix\+\_\+shortest\+\_\+path/matrix\+\_\+shortest\+\_\+path.\+h}}
{\ttfamily \#include $<$memory$>$}\\*
{\ttfamily \#include $<$array$>$}\\*
{\ttfamily \#include \char`\"{}src/header.\+h\char`\"{}}\\*
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Graph\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Matrix\+Type $>$ }\\Matrix\+Type \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a680307505286ae3230d1843c342e874e}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::extend\+\_\+path} (const Matrix\+Type \&L, const Matrix\+Type \&W)
\begin{DoxyCompactList}\small\item\em extend\+\_\+path：扩展一条边，算法导论25章25.1节 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Graph\+Type $>$ }\\std\+::array$<$ std\+::array$<$ typename Graph\+Type\+::\+E\+Weight\+Type,Graph\+Type\+::\+N\+U\+M $>$, Graph\+Type\+::\+N\+U\+M $>$ \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_ab9dcca59a42c708c137571d194c45bd9}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::matrix\+\_\+shortest\+\_\+path} (std\+::shared\+\_\+ptr$<$ Graph\+Type $>$ graph)
\begin{DoxyCompactList}\small\item\em matrix\+\_\+shortest\+\_\+path：返回所有节点对的最短路径的矩阵乘法算法。算法导论25章25.1节 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Graph\+Type $>$ }\\std\+::array$<$ std\+::array$<$ typename Graph\+Type\+::\+E\+Weight\+Type,Graph\+Type\+::\+N\+U\+M $>$, Graph\+Type\+::\+N\+U\+M $>$ \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a6eb979447eeb937df4158f9646e20dde}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::matrix\+\_\+shortest\+\_\+path\+\_\+fast} (std\+::shared\+\_\+ptr$<$ Graph\+Type $>$ graph)
\begin{DoxyCompactList}\small\item\em matrix\+\_\+shortest\+\_\+path：返回所有节点对的最短路径的矩阵乘法复平方算法。算法导论25章25.1节 \end{DoxyCompactList}\end{DoxyCompactItemize}
